Erratum to "Some new kinds of pseudoprimes"

نویسنده

  • Jerzy Browkin
چکیده

I am grateful to the editors of Mathematics of Computation for sending me Professor Zhang Zhenxiang’s remarks on my paper [1], and am indebted to him for pointing out some inaccuracies. • Page 1032, line 18: Replace “from (4′) if follows” by “(4′) follows from”. • Page 1032, line 24: Replace “(4′)” by “(4′′)”. • Page 1034, Table 1: In the row labelled “n7”, shift the data in the last column to one column earlier. • Page 1037, line 18: Replace “Elem2” by “Syl2”.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some new kinds of pseudoprimes

We define some new kinds of pseudoprimes to several bases, which generalize strong pseudoprimes. We call them Sylow p-pseudoprimes and elementary Abelian p-pseudoprimes. It turns out that every n < 1012, which is a strong pseudoprime to bases 2, 3 and 5, is not a Sylow p-pseudoprime to two of these bases for an appropriate prime p|n− 1. We also give examples of strong pseudoprimes to many bases...

متن کامل

Notes on some new kinds of pseudoprimes

J. Browkin defined in his recent paper (Math. Comp. 73 (2004), pp. 1031–1037) some new kinds of pseudoprimes, called Sylow p-pseudoprimes and elementary Abelian p-pseudoprimes. He gave examples of strong pseudoprimes to many bases which are not Sylow p-pseudoprime to two bases only, where p = 2 or 3. In this paper, in contrast to Browkin’s examples, we give facts and examples which are unfavora...

متن کامل

The Pseudoprimes to 25 • 109

The odd composite n < 25 • 10 such that 2n_1 = 1 (mod n) have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Carmichael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several...

متن کامل

Pseudoprime Reductions of Elliptic Curves

Let E be an elliptic curve over Q without complex multiplication, and for each prime p of good reduction, let nE(p) = |E(Fp)|. For any integer b, we are studying in this paper elliptic pseudoprimes to the base b. More precisely, let QE,b(x) be the number of primes p 6 x such that bE ≡ b (modnE(p)), and π E,b (x) be the number of compositive nE(p) such that b nE(p) ≡ b (modnE(p)) (also called el...

متن کامل

On the Generalized Fibonacci Pseudoprimes

In this paper the results established by the first two authors in [3], [4], and [5] are extended and generalized. After defining (in this section) classes of generalized Lucas numbers, {Vn(m)}9 governed by the positive integral parameter/??, the Fibonacci pseudoprimes of the m kind (/77-F.Psps.) are characterized in Section 2. A method for constructing them is discussed in Section 3, while some...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2005